#include <iostream>
#include <vector>

#include "MergeSort.h"
#include "HeapSort.h"


using namespace std;

int main (int argc, char *argv[])
{

	// Create random data
	vector<int> A;
	A.resize(4);
	A[0] = 1;
	A[1] = 4;
	A[2] = 1;
	A[3] = 2;

	// Do merge sort
	MergeSort *ms = new MergeSort();
	ms->doMergeSort(A,1,A.size());

	// Do heap sort
	HeapSort *hs = new HeapSort();
	hs->doHeapSort(A);

	return 0;
}
